Packing problems

Results: 74



#Item
51Other Problems of the First Ten Years: The Railroad Flatcar Problem Two railroad flatcars are to be loaded with seven types of packing crates.

Other Problems of the First Ten Years: The Railroad Flatcar Problem Two railroad flatcars are to be loaded with seven types of packing crates.

Add to Reading List

Source URL: www.comap.com

Language: English - Date: 2014-07-31 15:13:17
52arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨

arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2013-05-03 12:26:04
53APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2014-01-25 10:56:26
54PARTICLE PACKING PROBLEMS IN LOW SPACE DIMENSIONS Salvatore Torquato Princeton Center for Theoretical Science, Department of Chemistry, Materials Institute, Princeton University

PARTICLE PACKING PROBLEMS IN LOW SPACE DIMENSIONS Salvatore Torquato Princeton Center for Theoretical Science, Department of Chemistry, Materials Institute, Princeton University

Add to Reading List

Source URL: cherrypit.princeton.edu

Language: English - Date: 2008-12-08 18:22:44
55Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 02:04:54
56Lecture V §1. Joy Rides Page 1

Lecture V §1. Joy Rides Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-10-01 09:47:54
57Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Journal of Artificial Intelligence Research[removed]429 Submitted 6/06; published 3/07 Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2009-08-06 19:20:44
58SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

Add to Reading List

Source URL: siam.org

Language: English - Date: 2013-09-19 09:13:08
59Lecture V §1. Joy Rides Page 1

Lecture V §1. Joy Rides Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-10-01 09:50:59
60Elect. Comm. in Probab[removed]–90 ELECTRONIC COMMUNICATIONS in PROBABILITY

Elect. Comm. in Probab[removed]–90 ELECTRONIC COMMUNICATIONS in PROBABILITY

Add to Reading List

Source URL: www.emis.de

Language: English - Date: 2011-12-25 21:18:15